Constructions of Quasi-Twisted Two-Weight Codes
نویسنده
چکیده
— A code is said to be two-weight if the non-zero codewords have only two different a weight w 1 and w 2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length can be put in the quasi-twisted form. Based on this transformation, a new construction method of quasi-twisted (QT) two-weight codes is presented. A large amount of QT two-weight codes are found, and some new codes are also constructed.
منابع مشابه
New Construction of A Family of Quasi-Twisted Two-Weight Codes
— Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. codes are also obtained by the construction.
متن کاملNew Construction of 2-Generator Quasi-Twisted Codes
— Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. codes are also obtained by the construction.
متن کاملComputer construction of quasi-twisted two- weight codes
A code is said to be two-weight if the non-zero codewords have only two different weights w1 and w2. In this paper, it is generalized that a consta-cyclic code of composite length can be put in the quasi-twisted(QT) form. Based on this result, a new computer construction method of QT two-weight codes is presented. A large amount of QT two-weight codes are found, and several new codes are also
متن کاملThe twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
The structure of the twisted squaring construction, a generalization of the squaring construction, is studied with respect to trellis diagrams and complexity. We show that binary affine-invariant codes, which include the extended primitive BCH codes, and the extended binary quadratic-residue codes, are equivalent to twisted squaring construction codes. In particular, a recursive symmetric rever...
متن کاملQuasi-Cyclic Constructions of Quantum Codes
We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum distance of the involved codes. Supported in the previous results, we show algebraic constructions of good quantum codes and determine their parameters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0901.1244 شماره
صفحات -
تاریخ انتشار 2009